Twin Delayed DDPG based Dynamic Power Allocation for Mobility in IoRT

The internet of robotic things (IoRT) is a modern as well as fast-evolving technology employed in abundant socio-economical aspects which connect user equipment (UE) for communication and data transfer among each other. For ensuring the quality of service (QoS) in IoRT applications, radio resources, for example, transmitting power allocation (PA), interference management, throughput maximization etc., should be efficiently employed and allocated among UE. Traditionally, resource allocation has been formulated using optimization problems, which are then solved using mathematical computer techniques. However, those optimization problems are generally nonconvex as well as nondeterministic polynomial-time hardness (NP-hard). In this paper, one of the most crucial challenges in radio resource management is the emitting power of an antenna called PA, considering that the interfering multiple access channel (IMAC) has been considered. In addition, UE has a natural movement behavior that directly impacts the channel condition between remote radio head (RRH) and UE. Additionally, we have considered two well-known UE mobility models i) random walk and ii) modified Gauss-Markov (GM). As a result, the simulation environment is more realistic and complex. A data-driven as well as model-free continuous action based deep reinforcement learning algorithm called twin delayed deep deterministic policy gradient (TD3) has been proposed that is the combination of policy gradient, actor-critics, as well as double deep Q-learning (DDQL). It optimizes the PA for i) stationary UE, ii) the UE movements according to random walk model, and ii) the UE movement based on the modified GM model. Simulation results show that the proposed TD3 method outperforms model-based techniques like weighted MMSE (WMMSE) and fractional programming (FP) as well as model-free algorithms, for example, deep Q network (DQN) and DDPG in terms of average sum-rate performance

A Mathematical Algorithm of Locomotive Source Localization Based on Hyperbolic Technique

Recent trend shows that sensors situated on an axis in two-dimensional scenario measuring the time difference of arrival (TDOA) and frequency difference of arrival (FDOA) of the emitting signal from a moving source can estimate the emitting signal's position and velocity from the intersection point of hyperbola, which derives from TDOA and FDOA. However, estimating the location of an emitter based on hyperbolic measurements is a highly nonlinear problem with inconsistent data, which are created due to the measurement noise, the deviation between assumption model and actual field of the velocity, and so forth. In addition, the coefficient matrix of TDOA and FDOA equations set is singular in the linear sensor array network (LSAN). In this paper, a noniterative and simpler method is proposed to locate the instantaneous position of the moving source in LSAN by estimating the position and velocity based on TDOA and FDOA which does not have the convergence problem. In addition, the method avoids the singularity problem of LSAN by introducing the nuisance variables. The proposed method achieved the theoretical lower bound for near to far field with same and different velocity and different baseline of sensors in low to moderate noise